Perturbing Slivers in 3D Delaunay Meshes
نویسندگان
چکیده
Isotropic tetrahedron meshes generated by Delaunay refinement algorithms are known to contain a majority of well-shaped tetrahedra, as well as spurious sliver tetrahedra. As the slivers hamper stability of numerical simulations we aim at removing them while keeping the triangulation Delaunay for simplicity. The solution which explicitly perturbs the slivers through random vertex relocation and Delaunay connectivity update is very effective but slow. In this paper we present a perturbation algorithm which favors deterministic over random perturbation. The added value is an improved efficiency and effectiveness. Our experimental study applies the proposed algorithm to meshes obtained by Delaunay refinement as well as to carefully optimized meshes.
منابع مشابه
Sliver-free Three Dimensional Delaunay Mesh Generation By
A k ey step in the nite element method is to generate well-shaped meshes in 3D. A mesh is well-shaped if every tetrahedron element has a small aspect ratio. It is an old outstanding problem to generate well-shaped Delaunay meshes in three or more dimensions. Existing algorithms do not completely solve this problem, primarily because they can not eliminate all slivers. A sliver is a tetrahedron ...
متن کاملA Point Creation Strategy for Mesh Generation Using Crystal Lattices as Templates
A strategy is presented to define background meshes based on crystal lattices. Crystal-based background meshes have much better initial distribution of minimum dihedral angles than regular background meshes, facilitating the optimization procedures that rely on previously defined tetrahedral meshes. In addition, these background meshes can reduce significantly, or even eliminate, the number of ...
متن کاملSnow Globe: An Advancing-Front 3D Delaunay Mesh Refinement Algorithm
One of the objectives of a Delaunay mesh refinement algorithm is to produce meshes with tetrahedral elements having a bounded aspect ratio, which is the ratio between the radius of the circumscribing and inscribing spheres. The refinement is carried out by inserting additional Steiner vertices inside the circumsphere of a poor-quality tetrahedron (to remove the tetrahedron) at a sufficient dist...
متن کاملGenerating Well-Shaped Delaunay Meshes in 3D
A triangular mesh in 3D is a decomposition of a given geometric domain into tetrahedra. The mesh is wellshaped if the aspect ratio of every of its tetrahedra is bounded from above by a constant. It is Delaunay if the interior of the circum-sphere of each of its tetrahedra does not contain any other mesh vertices. Generating a well-shaped Delaunay mesh for any 3D domain has been a long term outs...
متن کاملConstruction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations
Three-dimensional Delaunay triangulations are the most common form of three-dimensional triangulations known, but they are not very suitable for tetrahedral nite element meshes because they tend to contain poorly-shaped sliver tetrahedra. In this paper, we present an algorithm for constructing improved-quality triangulations with respect to a tetrahedron shape measure. This algorithm uses combi...
متن کامل